<html>
<head><title>TODO</title></head>

<body>

<h2>Todo</h2>

<pre>
add sizeof to LFU/2Q.

implement a data structure which is time+space efficient for LRU, which
is a kind of linkedhashmap where the linkedlist is a red/black binary tree.

data structure for inserting softrefs inside the queue instead of keeping 
a separate one!!! included autocleaning.

check reasonability of tests
</pre>

<h2>Discarded ideas.</h2>
<ul>
<li><strike>Use ref queue for auto cleaning of softPool. Not proven, but strong 
suppositions that iterating the entire softPool is as fast as removing
many single entries.</strike><br>
	Actuable and efficient via a custom LinkedHashMap.</li>
</ul>

</body>

</html>